Efficient Single Frontier Bidirectional Search
نویسندگان
چکیده
The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA∗ which potentially uses only the square root of the memory required by A∗ but enables to prune many nodes that IDA∗ would generate. Experimental results show the benefit of our new approaches on a number of domains.
منابع مشابه
Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
In this paper we consider several variants of the problem of sorting integer permutations with a minimum number of moves, a task with many potential applications ranging from computational biology to logistics. Each problem is formulated as a heuristic search problem, where different variants induce different sets of allowed moves within the search tree. Due to the intrinsic nature of this cate...
متن کاملEffective Bidirectional A* with Frontier Search and External-Memory Utilization
We present an advanced Bidirectional A* algorithm featuring an application of Frontier Search and a strategy for the performance-efficient utilization of External Memory. We present the results of an experimental evaluation demonstrating that this algorithm is capable of tackling exceptionally large state spaces while consuming significantly less time and space than its A* counterpart. For inst...
متن کاملSingle-Frontier Bidirectional Search
We introduce a new bidirectional search algorithm, SingleFrontier Bidirectional Search (SFBDS). Unlike traditional BDS which keeps two frontiers, SFBDS uses a single frontier. At a particular node we can decide to search from start to goal or from goal to start, choosing the direction with the highest potential for minimizing the total work done. We provide theoretical analysis that explains wh...
متن کاملFinding efficient frontier of process parameters for plastic injection molding
Product quality for plastic injection molding process is highly related with the settings for its process parameters. Additionally, the product quality is not simply based on a single quality index, but multiple interrelated quality indices. To find the settings for the process parameters such that the multiple quality indices can be simultaneously optimized is becoming a research issue and ...
متن کاملUsing Lookaheads with Optimal Best-First Search
We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first search (DFS) by performing limited DFS lookaheads from the frontier of BFS. We show that this continuum requires significantly less memory than BFS. In addition, a time speedup is also achieved when choosing the lookahead depth correctly. We demonstrate this idea for breadth-first search ...
متن کامل